Generalised Adaptive Harmony Search: A Comparative Analysis of Modern Harmony Search
نویسندگان
چکیده
Harmony search (HS) was introduced in 2001 as a heuristic population-based optimisation algorithm. Since then HS has become a popular alternative to other heuristic algorithms like simulated annealing and particle swarm optimisation. However, some flaws, like the need for parameter tuning, were identified and have been a topic of study for much research over the last 10 years. Many variants of HS were developed to address some of these flaws, andmost of them have made substantial improvements. In this paper we compare the performance of three recent HS variants: exploratory harmony search, self-adaptive harmony search, and dynamic local-best harmony search. We compare the accuracy of these algorithms, using a set of well-known optimisation benchmark functions that include both unimodal andmultimodal problems. Observations from this comparison led us to design a novel hybrid that combines the best attributes of these modern variants into a single optimiser called generalised adaptive harmony search.
منابع مشابه
IIR System Identification Using Improved Harmony Search Algorithm with Chaos
Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...
متن کاملEFFICIENCY OF IMPROVED HARMONY SEARCH ALGORITHM FOR SOLVING ENGINEERING OPTIMIZATION PROBLEMS
Many optimization techniques have been proposed since the inception of engineering optimization in 1960s. Traditional mathematical modeling-based approaches are incompetent to solve the engineering optimization problems, as these problems have complex system that involves large number of design variables as well as equality or inequality constraints. In order to overcome the various difficultie...
متن کاملA New model for integrated lot sizing and scheduling in flexible job shop problem
In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...
متن کاملSHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH
The main aim of the present study is to propose a modified harmony search (MHS) algorithm for size and shape optimization of structures. The standard harmony search (HS) algorithm is conceptualized using the musical process of searching for a perfect state of the harmony. It uses a stochastic random search instead of a gradient search. The proposed MHS algorithm is designed based on elitism. In...
متن کاملApplication of Improved Harmony Search Algorithm in Test Case Selection
Regression test is an effective means to ensure the quality of software. But the test efficiency will become lower and lower as the test case library becomes increasingly large in the test. Therefore, in order to improve the efficiency and quality of regression test, it is necessary to implement the test case safety reduction. The optimization selection of the test case is an effective means of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Applied Mathematics
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013